Exact tail asymptotics for a discrete-time preemptive priority queue
نویسندگان
چکیده
منابع مشابه
The discrete-time preemptive repeat identical priority queue
Priority queueing systems come natural when customers with diversified delay requirements have to wait to get service. The customers that cannot tolerate but small delays get service priority over customers which are less delay-sensitive. In this contribution, we analyze a discretetime two-class preemptive repeat identical priority queue with infinite buffer space and generally distributed serv...
متن کاملDelay Analysis of a Discrete-Time Non-Preemptive Priority Queue with Priority Jumps
In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high ...
متن کاملDiscrete-Time Analysis of MAP/PH/1 Multiclass General Preemptive Priority Queue
We use the matrix-geometric method to study the MAP/PH/1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix P is presented. We show that the special upper triangular structure of the matrix R obtained by Miller [Computation of steady-state probabilities for M/M/1 priority queues, Oper Res 29(5) (1981),...
متن کاملTime-dependent performance analysis of a discrete-time priority queue
We present the transient analysis of the system content in a two-class discrete-time M X /D/1 priority queue. In particular, we derive an expression for the generating function of the transient system contents of both classes at the beginning of slots. Performance measures are calculated from this generating function. To illustrate our approach we conclude with some examples. c © 2008 Elsevier ...
متن کاملAnalysis of a discrete-time preemptive resume priority buffer
In this paper, we analyze a discrete-time preemptive resume priority queue. We consider two classes of customers which have to be served, where customers of one class have preemptive resume priority over customers of the other. Both classes contain customers with generally distributed service times. We show that the use of probability generating functions is beneficial for analyzing the system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematicae Applicatae Sinica, English Series
سال: 2015
ISSN: 0168-9673,1618-3932
DOI: 10.1007/s10255-015-0448-6